Fast balanced partitioning is hard even on grids and trees
نویسندگان
چکیده
منابع مشابه
Fast Balanced Partitioning Is Hard Even on Grids and Trees
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfactory approximation ratios, and those that guarantee high quality ratios but are slow. In this article we prove that this tradeoff between running time and solution quality is unavoidable. For the problem a minimum number of edges in a graph need to be found that, when c...
متن کاملTetris is Hard, Even to Approximate
Figure 1: The tetrominoes Sq (“square”), LG (“left gun”), RG (“right gun”), LS (“left snake”), RS (“right snake”), I, and T, with each piece’s center marked. of the top row of the gameboard, and falls downward at a constant speed. As it falls, the player can rotate the piece and slide it horizontally. If, when the piece comes to rest, all gridsquares in an entire row h of the gameboard are fill...
متن کاملPermanent is hard to compute even on a good day
We give an exposition of Cai, Pavan and Sivakumar’s result on the hardness of permanent. They show that assuming it is hard to compute the permanent in the worst case, an algorithm cannot compute the permanent correctly even on (say) a 1/n fraction of the inputs.
متن کاملDetecting communities is Hard (And Counting Them is Even Harder)
We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph G = (V, E), a subset S ⊆ V is an (α, β)-community if: • Every member of the community is friends with an α-fraction of the community; • Every non-member is friends with at most a β-fraction of the community. Arora et al [AGSS12] gave a quasi-polynomial time algorithm for enumerating all ...
متن کاملPreprocessing chains for fast dihedral rotations is hard or even impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into two subchains, and a dihedral rotation rotates one of these subchains rigidly about the edge. The problem is to determine, given a chain, an edge, and an angle of rotation, if the motion can be performed without causing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.03.014